TSTP Solution File: SEV168^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEV168^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:43:59 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 28 ( 7 unt; 14 typ; 0 def)
% Number of atoms : 107 ( 23 equ; 0 cnn)
% Maximal formula atoms : 3 ( 7 avg)
% Number of connectives : 20 ( 7 ~; 0 |; 8 &; 0 @)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 42 ( 41 >; 1 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 2 con; 0-6 aty)
% Number of variables : 40 ( 30 ^ 0 !; 0 ?; 40 :)
% ( 10 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
q: ( a > a > a ) > a ).
thf(func_def_2,type,
p: ( a > a > a ) > a ).
thf(func_def_6,type,
iCOMB:
!>[X0: $tType] : ( X0 > X0 ) ).
thf(func_def_7,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_8,type,
cCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X0 > X1 > X2 ) > X1 > X0 > X2 ) ).
thf(func_def_10,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_11,type,
vAND: $o > $o > $o ).
thf(func_def_12,type,
vOR: $o > $o > $o ).
thf(func_def_13,type,
vIMP: $o > $o > $o ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f19,plain,
$false,
inference(avatar_sat_refutation,[],[f17,f18]) ).
thf(f18,plain,
spl0_1,
inference(avatar_split_clause,[],[f12,f14]) ).
thf(f14,plain,
( spl0_1
<=> ( q = p ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f12,plain,
q = p,
inference(forward_demodulation,[],[f9,f10]) ).
thf(f10,plain,
p = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( q != p )
& ( p = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))) )
& ( q = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ( q != p )
& ( p = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))) )
& ( q = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( p = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))) )
& ( q = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))) ) )
=> ( q = p ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( ( ( p
= ( ^ [X0: a > a > a] :
vAPP(a,a,
vAPP(a,sTfun(a,a),X0,
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X1)),
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X3: a,X4: a] : X4)) ) )
& ( q
= ( ^ [X5: a > a > a] :
vAPP(a,a,
vAPP(a,sTfun(a,a),X5,
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X6: a,X7: a] : X6)),
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X8: a,X9: a] : X9)) ) ) )
=> ( q = p ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ( p
= ( ^ [X0: a > a > a] :
vAPP(a,a,
vAPP(a,sTfun(a,a),X0,
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X1)),
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X2)) ) )
& ( q
= ( ^ [X0: a > a > a] :
vAPP(a,a,
vAPP(a,sTfun(a,a),X0,
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X1)),
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X2)) ) ) )
=> ( q = p ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ( p
= ( ^ [X0: a > a > a] :
vAPP(a,a,
vAPP(a,sTfun(a,a),X0,
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X1)),
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X2)) ) )
& ( q
= ( ^ [X0: a > a > a] :
vAPP(a,a,
vAPP(a,sTfun(a,a),X0,
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X1)),
vAPP(sTfun(a,sTfun(a,a)),a,q,
^ [X1: a,X2: a] : X2)) ) ) )
=> ( q = p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM188_PARTIAL_pme) ).
thf(f9,plain,
q = vAPP(a,sTfun(sTfun(a,sTfun(a,a)),a),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),a)),cCOMB,vAPP(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a)),vAPP(sTfun(sTfun(a,sTfun(a,a)),sTfun(a,sTfun(a,a))),sTfun(a,sTfun(sTfun(a,sTfun(a,a)),sTfun(a,a))),cCOMB,iCOMB),vAPP(sTfun(a,sTfun(a,a)),a,q,kCOMB))),vAPP(sTfun(a,sTfun(a,a)),a,q,vAPP(sTfun(a,a),sTfun(a,sTfun(a,a)),kCOMB,iCOMB))),
inference(cnf_transformation,[],[f8]) ).
thf(f17,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f11,f14]) ).
thf(f11,plain,
q != p,
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEV168^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 12:00:50 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (30974)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (30978)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37 % Exception at run slice level
% 0.15/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.37 % (30977)WARNING: value z3 for option sas not known
% 0.15/0.38 % (30975)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (30976)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (30977)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (30980)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (30979)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (30981)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % Exception at run slice level% Exception at run slice level
% 0.15/0.38
% 0.15/0.38 User error: User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructsFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.38
% 0.15/0.38 % (30981)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.38 % (30979)First to succeed.
% 0.15/0.38 % (30980)Also succeeded, but the first one will report.
% 0.15/0.38 % (30979)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30974"
% 0.15/0.38 % (30981)Also succeeded, but the first one will report.
% 0.15/0.38 % (30977)Also succeeded, but the first one will report.
% 0.15/0.38 % (30979)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (30979)------------------------------
% 0.15/0.38 % (30979)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.38 % (30979)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (30979)Memory used [KB]: 757
% 0.15/0.38 % (30979)Time elapsed: 0.004 s
% 0.15/0.38 % (30979)Instructions burned: 4 (million)
% 0.15/0.38 % (30974)Success in time 0.018 s
%------------------------------------------------------------------------------